A Parallel Variant of the Gram-Schmidt Process with Reorthogonalization
نویسندگان
چکیده
c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher mentioned above.
منابع مشابه
Another Proof for Modified Gram-schmidt with Reorthogonalization
In this note, we consider the modified Gram-Schmidt algorithm with reorthogonalization applied on a numerical nonsingular matrix, we explain why the resulting set of vectors is orthogonal up to the machine precision level. To establish this result, we show that a certain L-criterion is necessarily verified after the second reorthogonalization step, then we prove that this L-criterion implies th...
متن کاملRobust Selective Gram-schmidt Reorthogonalization
A new criterion for selective reorthogonalization in the Gram-Schmidt procedure is given. We establish its comportment in presence of rounding errors when the criterion is used with modified Gram-Schmidt algorithm and show counter-example matrices which prove that standard criteria are not always valid. Experimentally, our criterion is fine also for the classical Gram-Schmidt algorithm with reo...
متن کاملPerformance Evaluation of Golub-Kahan-Lanczos Algorithm with Reorthogonalization by Classical Gram-Schmidt Algorithm and OpenMP
The Golub-Kahan-Lanczos algorithm with reorthogonalization (GKLR algorithm) is an algorithm for computing a subset of singular triplets for large-scale sparse matrices. The reorthogonalization tends to become a bottleneck of elapsed time, as the iteration number of the GKLR algorithm increases. In this paper, OpenMP-based parallel implementation of the classical Gram-Schmidt algorithm with reor...
متن کاملA Robust Criterion for the Modified Gram-Schmidt Algorithm with Selective Reorthogonalization
A new criterion for selective reorthogonalization in the modified Gram–Schmidt algorithm is proposed. We study its behavior in the presence of rounding errors. We give some counterexample matrices which prove that the standard criteria might fail. Through numerical experiments, we illustrate that our new criterion seems to be suitable also for the classical Gram– Schmidt algorithm with selectiv...
متن کاملPerformance Evaluation of Some Inverse Iteration Algorithms on PowerXCell 8i Processor
In this paper, we compare with the inverse iteration algorithms on PowerXCell 8i processor, which has been known as a heterogeneous environment. When some of all the eigenvalues are close together or there are clusters of eigenvalues, reorthogonalization must be adopted to all the eigenvectors associated with such eigenvalues. Reorthogonalization algorithms need a lot of computational cost. The...
متن کامل